- non-Hamiltonian graph
- негамильтонов граф
English-Russian Dictionary on Probability, Statistics, and Combinatorics. — Philadelphia and Moscow. Society for Industrial and Applied Mathematics and TVP Science Publishers. K. A. Borovkov. 1994.
non-Hamiltonian graph
Смотреть что такое "non-Hamiltonian graph" в других словарях:
Hamiltonian path — This article is about the overall graph theory concept of a Hamiltonian path. For the specific problem of determining whether a Hamiltonian path or cycle exists in a given graph, see Hamiltonian path problem. A Hamiltonian cycle in a dodecahedron … Wikipedia
Odd graph — The Petersen graph as an odd graph O3 Vertices Edges … Wikipedia
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Graph theory — In mathematics and computer science, graph theory is the study of graphs : mathematical structures used to model pairwise relations between objects from a certain collection. A graph in this context refers to a collection of vertices or nodes and … Wikipedia
Petersen graph — Infobox graph name = Petersen graph image caption = The Petersen graph is most commonly drawn as a pentagon with a pentagram inside, with five spokes. namesake = Julius Petersen vertices = 10 edges = 15 radius = 2 diameter = 2 girth = 5 chromatic … Wikipedia
Hypohamiltonian graph — In the mathematical field of graph theory, a graph G is said to be hypohamiltonian if G does not itself have a Hamiltonian cycle but every graph formed by removing a single vertex from G is Hamiltonian.HistoryHypohamiltonian graphs were first… … Wikipedia
Cubic graph — Not to be confused with graphs of cubic functions. The Petersen graph is a Cubic graph … Wikipedia
Meredith graph — The Meredith graph Named after G. H. Meredith Vertices 70 Edges 140 … Wikipedia
Tietze's graph — The Tietze s graph Vertices 12 Edges 18 Diameter … Wikipedia
Desargues graph — Named after Gérard Desargues Vertices 20 Edges 30 … Wikipedia
Snark (graph theory) — In graph theory, a snark is a connected, bridgeless cubic graph with chromatic index equal to 4. In other words, it is a graph in which every vertex has three neighbors, and the edges cannot be colored by three colors without two edges of the… … Wikipedia
